GoodTecher

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

Skip to content
Menu
  • Home
  • LeetCode
    • Array
    • Binary Search
    • Binary Tree
    • Depth First Search
    • Design
    • Dynamic Programming
    • Linked List
    • Math
    • Stack
    • String
    • Two Pointers
    • Union Find
  • Useful

Category: Binary Tree

  • Posted on April 14, 2018January 15, 2021
  • Binary Tree

LeetCode 101. Symmetric Tree

Description https://leetcode.com/problems/symmetric-tree/description/ Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For…

Continue Reading
  • Posted on April 7, 2018February 3, 2021
  • Binary Tree

LeetCode 100. Same Tree

Description https://leetcode.com/problems/same-tree/ Given the roots of two binary trees p and q, write a function to check if they are the same or…

Continue Reading
  • Posted on September 24, 2017March 25, 2018
  • Binary Tree

LeetCode 144. Binary Tree Preorder Traversal

Description https://leetcode.com/problems/binary-tree-preorder-traversal/description/ Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, 1 \ 2…

Continue Reading

Posts navigation

Previous Page Page 1 … Page 6 Page 7

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (7)
  • LeetCode (588)
    • Array (185)
    • Backtracking (18)
    • Binary Search (19)
    • Binary Tree (63)
    • Bit Manipulation (15)
    • Database (40)
    • Depth First Search (6)
    • Design (10)
    • Dynamic Programming (17)
    • Graph (18)
    • Greedy (5)
    • Heap (1)
    • Linked List (26)
    • Math (36)
    • Recursion (3)
    • Sorting (11)
    • Stack (11)
    • String (95)
    • Two Pointers (12)
    • Union Find (2)
  • Machine Learning (7)
  • Technical Solutions (2)
  • Useful (3)
© Copyright 2025 – GoodTecher
Cell Theme by DesignOrbital ⋅ Powered by WordPress