반응형

tree

    [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal - Java
    알고리즘/LeetCode

    [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal - Java

    https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ Construct Binary Tree from Preorder and Inorder Traversal - LeetCode Can you solve this real interview question? Construct Binary Tree from Preorder and Inorder Traversal - Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the i..

    [LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree - Java
    알고리즘/LeetCode

    [LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree - Java

    https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/ Lowest Common Ancestor of a Binary Search Tree - LeetCode Lowest Common Ancestor of a Binary Search Tree - Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According to the definition of LCA on Wikipedia [https://en.wikipedia.org/wiki/Lowest_common_..

    [LeetCode] 98. Validate Binary Search Tree - Java
    알고리즘/LeetCode

    [LeetCode] 98. Validate Binary Search Tree - Java

    https://leetcode.com/problems/validate-binary-search-tree/description/ Validate Binary Search Tree - LeetCode Validate Binary Search Tree - Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: * The left subtree of a node contains only nodes with keys less than the node's key. * The right subtree leetcode.com 문제 Given the root o..

    [LeetCode] 102. Binary Tree Level Order Traversal - Java
    알고리즘/LeetCode

    [LeetCode] 102. Binary Tree Level Order Traversal - Java

    https://leetcode.com/problems/binary-tree-level-order-traversal/ Binary Tree Level Order Traversal - LeetCode Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: [https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg] Input: root = [ leetcode.com 문제 Given the root of ..

    [LeetCode] 572. Subtree of Another Tree - Java
    알고리즘/LeetCode

    [LeetCode] 572. Subtree of Another Tree - Java

    https://leetcode.com/problems/subtree-of-another-tree/description/ Subtree of Another Tree - LeetCode Subtree of Another Tree - Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a binary tree tree is a tree that consists of a n leetcode.com 문제 Given the roots of two ..

반응형

티스토리툴바