# LeetCode 951. Flip Equivalent Binary Trees

Description https://leetcode.com/problems/flip-equivalent-binary-trees/ For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/flip-equivalent-binary-trees/ For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and…

Description https://leetcode.com/problems/count-complete-tree-nodes/ Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia:In a complete…

Description https://leetcode.com/problems/word-ladder/ Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such…

Description https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ Serialization is the process of converting a data structure or object into a sequence of bits so that…

Description https://leetcode.com/problems/search-a-2d-matrix-ii/ You are given a perfect binary tree where all leaves are on the same level, and every parent has two children.…

Description https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then…

Description https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do…

Description https://leetcode.com/problems/kth-smallest-element-in-a-bst/ Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Example 1: Input: root…

Description https://leetcode.com/problems/binary-tree-inorder-traversal/ Given a binary tree, return the inorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 / 3…

Description https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ Return the root node of a binary search tree that matches the given preorder traversal. (Recall that a binary search tree is a…