树

Record a recursive method for determining whether a sequence is the postorder traversal result of a binary search tree.

Record methods for finding the inorder successor of a binary-tree node through a full inorder traversal or parent-pointer relationships.

Record inorder-traversal and recursive methods for converting a binary search tree into a sorted doubly linked list.

Record inorder-traversal methods for finding the kth smallest node in a binary search tree, plus reverse inorder traversal for the kth largest node.

Record a recursive method for computing binary-tree depth by taking the greater depth of the left and right subtrees.

Record queue-based level-order traversal for printing binary-tree nodes from top to bottom.

Record a recursive method for determining whether a binary tree is symmetric by comparing mirrored positions in its left and right subtrees.

Record a method for determining whether a binary tree is balanced by comparing subtree heights and recursively checking both subtrees.

Record recursive, stack-based, and queue-based methods for generating the mirror of a binary tree by swapping left and right subtrees.

Record a queue-based method that uses end-of-line pointers to print a binary tree level by level, one line per level.

Record a zigzag traversal method by reversing alternating rows after level-order traversal.

Record a preorder-recursive matching method for determining whether one binary tree is a substructure of another.

Record the recursive method for reconstructing a binary tree from preorder and inorder traversal results.

Record the depth-first, preorder traversal, and backtracking method for finding binary-tree paths with a given sum.

Record methods for serializing and deserializing a binary tree using preorder traversal and a preorder-plus-inorder traversal combination.