Tree

Search Tags

144. Binary Tree Preorder Traversal

94. Binary Tree Inorder Traversal

106. Construct Binary Tree from Inorder and Postorder Traversal

105. Construct Binary Tree from Preorder and Inorder Traversal

107. Binary Tree Level Order Traversal II

108. Convert Sorted Array to Binary Search Tree

113. Path Sum II

112. Path Sum

103. Binary Tree Zigzag Level Order Traversal

145. Binary Tree Postorder Traversal

543. Diameter of Binary Tree

250. Count Univalue Subtrees

426. Convert Binary Search Tree to Sorted Doubly Linked List

429. N-ary Tree Level Order Traversal

1008. Construct Binary Search Tree from Preorder Traversal

199. Binary Tree Right Side View

04-04 - Check Balanced [Cracking the Coding Interview]

04-05 - Validate BST [Cracking the Coding Interview]

04-02 - Minimal Tree [Cracking the Coding Interview]

04-03 - List of Depths [Cracking the Coding Interview]

700. Search in a Binary Search Tree

863. All Nodes Distance K in Binary Tree

865. Smallest Subtree with all the Deepest Nodes

701. Insert into a Binary Search Tree

1110. Delete Nodes And Return Forest

102. Binary Tree Level Order Traversal

109. Convert Sorted List to Binary Search Tree

98. Validate Binary Search Tree

208. Implement Trie (Prefix Tree)