• Skip to primary navigation
  • Skip to content
  • Skip to footer
Jiwon Chang
  • Algorithm
  • Data Structure
  • Self-Development
    장지원

    장지원

    Game Developer. Unity. Lua. Go.

    • Seoul, Korea
    • Email
    • Blog
    • GitHub
    • Youtube

    Implement balanced binary search tree

    On this page

    • GO code
    • output
    • big-O

    GO code

    output

    1
    2
    5
    7
    9
    10
    11
    14
    20
    

    big-O

    • insertion : O(log n)
    • traverse : O(n)

    Updated: January 11, 2023

    Previous Next

    You may also enjoy

    GitHub Check List

    Checklist for Git hub settings that need to be done.

    What I Should Do in Coding Tests

    I summarized the attitudes and actions to be done in the coding test in three ways.

    8 Types of Sort

    Implement bubble sort, selection sort, insertion sort, shell sort, quick sort, heap sort, merge sort and radix sort

    Is subTree

    Implement an algorithm that checks whether one tree is a subtree of the other tree.

    • Follow:
    • GitHub
    • Youtube
    • Feed
    © 2023 장지원. Powered by Jekyll & Minimal Mistakes.